A type system for Discretionary Access Control
نویسندگان
چکیده
منابع مشابه
A type system for Discretionary Access Control
Discretionary Access Control (DAC) systems provide powerful resource management mechanisms based on the selective distribution of capabilities to selected classes of principals. We study a type-based theory of DAC models for a process calculus that extends Cardelli, Ghelli and Gordon’s pi-calculus with groups (Cardelli et al., 2005). In our theory, groups play the rôle of principals, the unit o...
متن کاملType Based Discretionary Access Control
Discretionary Access Control (DAC) systems provide powerful mechanisms for resource management based on the selective distribution of capabilities to selected classes of principals. We study a type-based theory of DAC models for concurrent and distributed systems represented as terms of Cardelli, Ghelli and Gordon’s pi calculus with groups [3]. In our theory, groups play the rôle of principals,...
متن کاملUsing Recommenders for Discretionary Access Control
Enterprises increasingly subscribe to Software as a Service (SaaS) applications for collaboration. In the past, enterprise organizational boundaries have been key to the controls on sharing, providing both a social and technical boundary that can slow or stop potentially inappropriate sharing. However, SaaS collaboration technology is often used to across enterprise boundaries. One of the key s...
متن کاملTowards a Mechanism for Discretionary Overriding of Access Control
Traditional access control models either permit access or deny it completely. There is an implicit assumption that all access needs are known in advance and that the conditions of those needs can be expressed in machine readable form. However, reality is dynamic and unanticipated situations occur all the time. Most manual administrative procedures are flexible enough to allow people to stretch ...
متن کاملThe Complexity of Discretionary Access Control
A recent paper presented an access control scheme for discretionary access controls with a decidable safety problem. This paper deals with the complexity analysis of that access control, and finds it to be, in its worst cases, PSPACE-complete, but polynomial time for practical cases. The PSPACE-hardness reduction uses the theory of succinct problems in a more general manner than circuit represe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2009
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129509007762